Erik Demaine - PDFSEARCH.IO - Document Search Engine

Erik Demaine
Results: 203

#	Item
171	6.849: Geometric Folding Algorithms Fall 2010 — Prof. Erik Demaine Problem Set 2 Due: Wednesday, October 20, 2010 Problem 1. Who designed the following origami models? (Review the slides from Lectures 4 Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2010-10-05 14:19:21 Mathematics Origami Straight skeleton Crease Structural rigidity Paper folding Visual arts Arts
172	6.851: Advanced Data Structures Spring 2012 Lecture 2 — 02/09, 2012 Prof. Erik Demaine Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2012-05-29 13:10:42 Abstract data types Computer programming Priority queue Data structures Bin Persistent data structure Rope Fractional cascading Segment tree Graph theory Binary trees Computing
173	Microsoft Word - poster.doc Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2007-01-16 22:14:02 Knots Numerals Quipu Linguistics Notation Gary Urton Inca Empire Erik Demaine Andean civilizations MacArthur Fellows Inca Americas
174	Retroactive Data Structures ERIK D. DEMAINE Massachusetts Institute of Technology and JOHN IACONO Polytechnic University Add to Reading List Source URL: erikdemaine.org Language: English - Date: 2007-05-21 16:15:43 Database management systems Abstract data types Software engineering Dynamization Disjoint-set data structure Persistent data structure Database Priority queue SQL Data structures Computing Data management
175	6.851: Advanced Data Structures Spring 2012 Lecture 11 — March 22, 2012 Prof. Erik Demaine Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2012-05-17 11:31:50 Graph theory Computing Search algorithms Van Emde Boas tree Binary search tree Binary search algorithm Time complexity Pointer machine Search tree Theoretical computer science Binary trees Data structures
176	6.851: Advanced Data Structures Spring 2012 Lecture 13 — April 5, 2012 Prof. Erik Demaine Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2012-05-29 13:10:42 Communication Computational complexity theory Analysis of algorithms Asymptotic analysis Big O notation Mathematical notation Information theory Communication complexity Combinatory logic Theoretical computer science Applied mathematics Mathematics
177	6.851: Advanced Data Structures Spring 2012 Lecture 18 — April 26, 2012 Prof. Erik Demaine Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2012-04-30 01:03:01 Arrays Data structures Suffix tree Compressed suffix array Suffix array Bit array String Trie Succinct data structure Computing Theoretical computer science Computer programming
178	Introduction to Algorithms: 6.006 Massachusetts Institute of Technology Professors Erik Demaine and Srini Devadas September 16, 2011 Problem Set 1 Solutions Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-09-20 16:34:21 Analysis of algorithms Asymptotic analysis Estimation theory Exponentials Exponentiation Algorithm Time complexity Big O notation Master theorem Mathematics Theoretical computer science Applied mathematics
179	Anchor-Free Distributed Localization in Sensor Networks Nissanka B. Priyantha, Hari Balakrishnan, Erik Demaine, and Seth Teller Tech Report #892, April 15, 2003 MIT Laboratory for Computer Science http://nms.lcs.mit.edu/ Add to Reading List Source URL: nms.lcs.mit.edu Language: English - Date: 2004-01-16 02:36:26 Combinatorics Force-based algorithms Topology Routing Unit disk graph A* search algorithm Graph theory Graph drawing Mathematics
180	6.851: Advanced Data Structures Spring 2012 Lecture 4 — February 28, 2012 Prof. Erik Demaine Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2012-05-29 13:10:43 Fibonacci heap Fractional cascading Golden ratio FO Sheaf Mathematics Theoretical computer science Numbers

UPDATE